Beyond the Storage Capacity: Data-Driven Satisfiability Transition
نویسندگان
چکیده
منابع مشابه
Data Replication and the Storage Capacity of Data Grids
Storage is undoubtedly one of the main resources in data grids, and planning the capacity of storage nodes is an important step in any data-grid design. This paper focuses on storage-capacity planning for data grids. We have developed a tool to calculate, for a specific scenario, the minimum capacity required for each storage node in a grid, and we have used this tool to show that different str...
متن کاملSatisfiability-unsatisfiability transition in the adversarial satisfiability problem.
Adversarial satisfiability (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a Boolean formula true (resp. false) by controlling their respective sets of variables. AdSAT belongs to a higher complexity class in the polynomial hierarchy than SAT, and therefore the nature of the critical region and the transition are not easily parallel to those of S...
متن کاملSatisfiability Thresholds beyond k -XORSAT
We consider random systems of equations x1 + · · · + xk = a, 0 ≤ a ≤ 2 which are interpreted as equations modulo 3. We show for k ≥ 15 that the satisfiability threshold of such systems occurs where the 2−core has density 1. We show a similar result for random uniquely extendible constraints over 4 elements. Our results extend previous results of Dubois/Mandler for equations mod 2 and k = 3 and ...
متن کاملTransition-metal-ethylene complexes as high-capacity hydrogen-storage media.
From first-principles calculations, we predict that a single ethylene molecule can form a stable complex with two transition metals (TM) such as Ti. The resulting TM-ethylene complex then absorbs up to ten hydrogen molecules, reaching to gravimetric storage capacity of approximately 14 wt %. Dimerization, polymerizations, and incorporation of the TM-ethylene complexes in nanoporous carbon mater...
متن کاملMaximum Transition Run Codes for Data Storage
A b s t r a c t − A new code is presented which improves the minimum distance properties of sequence detectors operating at high linear densities. This code, which is called the maximum transition run code, eliminates data patterns producing three or more consecutive transitions while imposing the usual k-constraint necessary for timing recovery. The code possesses the similar distance-gaining ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2020
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.125.120601